Blended Biogeography-based Optimization for Constrained Optimization

Biogeography-based optimization (BBO) is a new evolutionary optimization method that is based on the science of biogeography. We propose two extensions to BBO. First, we propose a blended migration operator. Benchmark results show that blended BBO outperforms standard BBO. Second, we employ blended BBO to solve constrained optimization problems. Constraints are handled by modifying the BBO immigration and emigration procedures. The approach that we use does not require any additional tuning parameters beyond those that are required for unconstrained problems. The constrained blended BBO algorithm is compared with solutions based on a stud genetic algorithm (SGA) and standard particle swarm optimization 2007 (SPSO 07). The numerical results demonstrate that constrained blended BBO outperforms SGA and performs similarly to SPSO 07 for constrained single-objective optimization problems

Analysis of Migration Models of Biogeography-based Optimization Using Markov Theory

Biogeography-based optimization (BBO) is a new evolutionary algorithm inspired by biogeography, which involves the study of the migration of biological species between habitats. Previous work has shown that various migration models of BBO result in significant changes in performance. Sinusoidal migration models have been shown to provide the best performance so far. Motivated by biogeography theory and previous results, in this paper a generalized sinusoidal migration model curve is proposed. A previously derived BBO Markov model is used to analyze the effect of migration models on optimization performance, and new theoretical results which are confirmed with simulation results are obtained. The results show that the generalized sinusoidal migration model is significantly better than other models for simple but representative problems, including a unimodal one-max problem, a multimodal problem, and a deceptive problem. In addition, performance comparison is further investigated through 23 benchmark functions with a wide range of dimensions and diverse complexities, to verify the superiority of the generalized sinusoidal migration model

Adaptive Control for Robotic Manipulators base on RBF Neural Network

An adaptive neural network controller is brought forward by the paper to solve trajectory tracking problems of robotic manipulators with uncertainties.  The  first  scheme consists of  a PD feedback  and  a  dynamic  compensator  which is  composed by  neural  network controller and  variable  structure controller.  Neutral network controller is designed to adaptive learn and compensate the unknown uncertainties, variable   structure controller is designed to eliminate approach errors of neutral network. The adaptive weight learning algorithm of neural network is designed to ensure online real-time adjustment, offline learning phase is not need; Global asymptotic stability (GAS) of system base on Lyapunov theory is analysised to ensure the convergence of the algorithm. The simulation results show that the kind of the control scheme is effective and has good robustness

Ensemble Multi-Objective Biogeography-Based Optimization with Application to Automated Warehouse Scheduling

This paper proposes an ensemble multi-objective biogeography-based optimization (EMBBO) algorithm, which is inspired by ensemble learning, to solve the automated warehouse scheduling problem. First, a real-world automated warehouse scheduling problem is formulated as a constrained multi-objective optimization problem. Then EMBBO is formulated as a combination of several multi-objective biogeography-based optimization (MBBO) algorithms, including vector evaluated biogeography-based optimization (VEBBO), non-dominated sorting biogeography-based optimization (NSBBO), and niched Pareto biogeography-based optimization (NPBBO). Performance is tested on a set of 10 unconstrained multi-objective benchmark functions and 10 constrained multi-objective benchmark functions from the 2009 Congress on Evolutionary Computation (CEC), and compared with single constituent MBBO and CEC competition algorithms. Results show that EMBBO is better than its constituent algorithms, and among the best CEC competition algorithms, for the benchmark functions studied in this paper. Finally, EMBBO is successfully applied to the automated warehouse scheduling problem, and the results show that EMBBO is a competitive algorithm for automated warehouse scheduling

Biogeography-based Optimization in Noisy Environments

Biogeography-based optimization (BBO) is a new evolutionary optimization algorithm that is based on the science of biogeography. In this paper, BBO is applied to the optimization of problems in which the fitness function is corrupted by random noise. Noise interferes with the BBO immigration rate and emigration rate, and adversely affects optimization performance. We analyse the effect of noise on BBO using a Markov model. We also incorporate re-sampling in BBO, which samples the fitness of each candidate solution several times and calculates the average to alleviate the effects of noise. BBO performance on noisy benchmark functions is compared with particle swarm optimization (PSO), differential evolution (DE), self-adaptive DE (SaDE) and PSO with constriction (CPSO). The results show that SaDE performs best and BBO performs second best. In addition, BBO with re-sampling is compared with Kalman filter-based BBO (KBBO). The results show that BBO with re-sampling achieves almost the same performance as KBBO but consumes less computational tim

Interactive Markov Models of Evolutionary Algorithms

This paper introduces a Markov model for evolutionary algorithms (EAs) that is based on interactions among individuals in the population. This interactive Markov model has the potential to provide tractable models for optimization problems of realistic size. We propose two simple discrete optimization search strategies with population-proportion-based selection and a modified mutation operator. The probability of selection is linearly proportional to the number of individuals at each point of the search space. The mutation operator randomly modifies an entire individual rather than a single decision variable. We exactly model these optimization search strategies with interactive Markov models. We present simulation results to confirm the interactive Markov model theory. We show that genetic algorithms and biogeography-based optimization perform better with the addition of population-proportion-based selection on a set of real-world benchmarks. We note that many other EAs, both new and old, might be able to be improved with this addition, or modeled with this method